New Penalty functions, which have better convergence properties, as compared to the commonly used exterior and interior Penalty functions, have been proposed in this paper. The convergence behavior and accuracy of ordinary Penalty functions depend on the selection of appropriate Penalty parameters. The optimization of ordinary Penalty functions is accomplished after several rounds of optimization where, at each round a different but fixed value of Penalty parameter is used. While some useful hints and rules for the selection of suitable Penalty parameter values have been provided by different authors, the objective of this paper has been to improve this procedure by including the Penalty parameter in the design vector, so that it can be modified during the optimization, automatically, in order to improve the convergence characteristics. This can also help accomplish optimization in only one round, which is of considerable importance when it is desired to solve a constrained problem by using genetic algorithms. The proof of convergence to the optimum solution of the proposed functions is also included in the paper. Ten-bar and three-bar truss examples are used for illustration through which the convergence of ordinary and new functions are evaluated and compared. The results show that the new Penalty functions can outperform the ordinary functions, especially in combination with genetic algorithms.